Edge fault tolerance of graphs with respect to super edge connectivity
نویسندگان
چکیده
منابع مشابه
Edge-connectivity and super edge-connectivity of P2-path graphs
For a graph G, the P2-path graph, P2(G), has for vertices the set of all paths of length 2 in G. Two vertices are connected when their union is a path or a cycle of length 3. We present lower bounds on the edge-connectivity, (P2(G)) of a connected graph G and give conditions for maximum connectivity. A maximally edge-connected graph is superif each minimum edge cut is trivial, and it is optimum...
متن کاملA note on edge fault tolerance with respect to hypercubes
In the previous studies on k-edge fault tolerance with respect to hypercubes Qn , matrices for generating linear k-EFT(Qn) graphs were used. Let EFT L(n, k) denote the set of matrices that generate linear k-EFT(Qn) graphs. A matrix in EFT L(n, k) with the smallest number of rows among all matrices in EFT L(n, k) is optimal. We use eftL(n, k) to denote the difference between the number of rows a...
متن کاملEdge fault tolerance of super edge connectivity for three families of interconnection networks
Let G = (V,E) be a connected graph. G is said to be super edge connected (or super-k for short) if every minimum edge cut of G isolates one of the vertex of G. A graph G is called m-super-k if for any edge set S # E(G) with jSj 6m, G S is still super-k. The maximum cardinality of m-super-k is called the edge fault tolerance of super edge connectivity of G. In this paper, we discuss the edge fau...
متن کاملMultiple-Edge-Fault Tolerance with Respect to Hypercubes
Previous works on edge-fault tolerance with respect to hypercubes Qn are mainly focused on 1-edge fault and 2or 3edge fault with limited size of n. We give a construction scheme for 2-EFT(Qn) graphs and 3-EFT(Qn) graphs, where n is arbitrarily large. In our constructions, approximately log n extra degree is added to the vertices of Qn for 2-edge-fault tolerance, and one more degree for 3-edge-f...
متن کاملOn the edge-connectivity of C_4-free graphs
Let $G$ be a connected graph of order $n$ and minimum degree $delta(G)$.The edge-connectivity $lambda(G)$ of $G$ is the minimum numberof edges whose removal renders $G$ disconnected. It is well-known that$lambda(G) leq delta(G)$,and if $lambda(G)=delta(G)$, then$G$ is said to be maximally edge-connected. A classical resultby Chartrand gives the sufficient condition $delta(G) geq frac{n-1}{2}$fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2012
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.10.033